Two semi-online scheduling problems on two uniform machines
نویسندگان
چکیده
منابع مشابه
Two semi-online scheduling problems on two uniform machines
This paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. For the first problem, we provide an optimal algorithm for s ∈ [ 1+ √
متن کاملSemi-online scheduling on two uniform processors
In this paper we consider the problem of semi on-line scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. We derive lower bounds and algorithms, ...
متن کاملSemi-online scheduling problems on two uniform machines under a grade of service provision
In this talk, we discuss semi-online scheduling on two uniform machines under a grade of service (GoS) provision, where one machine with speed one can process all jobs, and the other machine with speed s (s>0) can only process some jobs. The objective is to minimize the makespan. We consider two variants, where the total size of jobs or the optimal makespan is known in advance. For both variant...
متن کاملOptimal Non-preemptive Semi-online Scheduling on Two Related Machines
We consider the following non-preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines, with the goal of minimizing the makespan. We analyze both the optimal overall competitive ratio, and the optimal competitive ratio as a function of the speed ratio (q ≥ 1) between the two machines. We show that the greedy al...
متن کاملSemi-Online Scheduling on Two Uniform Machines with Known Optimum Part I: Tight Lower Bounds
This problem is about to schedule a number of jobs of different lengths on two uniform machines with given speeds 1 and s ≥ 1, so that the overall completion time, i.e., the makespan, is earliest possible. We consider a semi-online variant (introduced for equal speeds) by Azar and Regev, where the jobs arrive one after the other, while the scheduling algorithm knows the optimum value of the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.11.018